Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi

Gen2sat is an efficient and generic theorem prover that can decide derivability for a wide variety of propositional non-classical logics given in terms of a sequent system. It contributes to the line of research on computer-supported tools for investigation and construction of logics in the spirit of the “logic engineering” paradigm. Its generality and efficiency are made possible by encoding a reduction of derivability in pure analytic Gentzen-style calculi to the classical satisfiability problem. This also makes Gen2sat a “plug-and-play” tool so it is compatible with any standard off-the-shelf SAT solver and does not require any additional logic-specific resources. We describe an implementation of Gen2sat, as well as a pilot study for using it an a “hands on” assignment for teaching the concept of sequent calculi in a logic class for engineering practitioners.